A cross decomposition procedure for the facility location problem with a choice of facility type
نویسندگان
چکیده
منابع مشابه
A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملReliable Facility Location Problem with Facility Protection
This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian...
متن کاملA Congested Facility Location Problem
Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queueing process. We strive to minimize the sum of customers' transportation and waiting times, and facilities' xed and variable costs. The problem is solved using a column generation technique within a Branch-and-Bound scheme. Numerical results are repo...
متن کاملA Fast Algorithm for Facility Location Problem
In this paper, we present an approximation algorithm achieving approximation guarantee of 2 for the classical uncapacitated facility location problem. The distinguishing feature of our designed algorithm is the overall low running time of ( log ) O m m , where c f m n n = × , c n and f n are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 1986
ISSN: 0360-8352
DOI: 10.1016/0360-8352(86)90014-8